A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
نویسندگان
چکیده
منابع مشابه
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets.
متن کاملMaximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in nitely many new pairs (s; v). c © 1999 Published by Elsevier Science B.V. All rights reserved
متن کاملPermutation polynomials induced from permutations of subfields, and some complete sets of mutually orthogonal latin squares
We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f(x) and f(x) + x induce permutations of the field, which has combin...
متن کاملComplete Sets of Orthogonal Self-Orthogonal Latin Squares
We show how to produce algebraically a complete orthogonal set of Latin squares from a left quasifield and how to generate algebraically a maximal set of self-orthogonal Latin squares from a left nearfield. For a left Veblen-Wedderburn system, we establish the algebraic relationships between the standard projective plane construction of a complete set of Latin squares, our projective plane cons...
متن کاملCritical sets in equi-orthogonal frequency squares
In this paper, we study critical sets in pairs of equiorthogonal frequency squares. Using this stronger definition of orthogonality, a pair of equiorthogonal frequency squares is classified into one of three classes depending on the isomorphism or orthogonality of the corresponding rows and columns. We provide a general theorem determining the size of the critical set of a pair of equiorthogona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2000
ISSN: 1077-8926
DOI: 10.37236/1543